package com.zj.leetcode.medium.tree;

/**
 * @program: algorithm
 * @description: 修剪二叉搜索树
 * 669 trim-a-binary-search-tree
 * @author: Zhang Bo
 * @create: 2022-07-09 18:45:01
 **/
public class TrimABinarySearchTree {
    public static void main(String[] args) {
        Solution solution = new TrimABinarySearchTree().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)

    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode() {
        }

        TreeNode(int val) {
            this.val = val;
        }

        TreeNode(int val, TreeNode left, TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }
    }

    class Solution {
        public TreeNode trimBST(TreeNode root, int low, int high) {
            if (root == null)
                return root;

            if (root.val < low)
                return trimBST(root.right, low, high);
            if (root.val > high)
                return trimBST(root.left, low, high);

            root.left = trimBST(root.left, low, high);
            root.right = trimBST(root.right, low, high);
            return root;
        }


    }
//leetcode submit region end(Prohibit modification and deletion)

}